Computational Intelligence in Data Mining

In this paper, we propose a method of finding simple disjoint decompositions in frequent itemset data. The techniques for decomposing Boolean functions have been studied long time the area logic circuit design, and recently, there is very efficient algorithm to find all possible given based on BDDs (Binary Decision Diagrams). We consider data model called “sets combinations” instead functions, present similar set combinations. Our will be useful extracting interesting hidden structures from transaction database. show some experimental results conventional benchmark